Two distance-regular graphs
نویسندگان
چکیده
We construct two families of distance-regular graphs, namely the subgraph of the dual polar graph of type B3(q) induced on the vertices far from a fixed point, and the subgraph of the dual polar graph of type D4(q) induced on the vertices far from a fixed edge. The latter is the extended bipartite double of the former.
منابع مشابه
D-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs
The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...
متن کاملDistance-Balanced Closure of Some Graphs
In this paper we prove that any distance-balanced graph $G$ with $Delta(G)geq |V(G)|-3$ is regular. Also we define notion of distance-balanced closure of a graph and we find distance-balanced closures of trees $T$ with $Delta(T)geq |V(T)|-3$.
متن کاملDistance regular covers of the complete graph
Distance regular graphs fall into three families: primitive, antipodal, and bipar-tite. Each antipodal distance regular graph is a covering graph of a smaller (usually primitive) distance regular graph; the antipodal distance graphs of diameter three are covers of the complete graph, and are the first non-trivial case. Many of the known examples are connected with geometric objects, such as pro...
متن کاملTwo results concerning distance-regular directed graphs
The study of distance-regular directed graphs can be reduced to that of short distance-regular directed graphs. We consider the eigenspaces of the intersection matrix of a short distance-regular directed graph and show that nearly all the eigenvalues are nonreal. Next we show that a nontrivial short distance-regular directed graph is primitive.
متن کاملSe p 20 09 There are only finitely many distance - regular graphs of fixed valency greater than two
There are only finitely many distance-regular graphs of fixed valency greater than two Abstract In this paper we prove the Bannai-Ito conjecture, namely that there are only finitely many distance-regular graphs of fixed valency greater than two.
متن کاملDual concepts of almost distance-regularity and the spectral excess theorem
Generally speaking, ‘almost distance-regular’ graphs share some, but not necessarily all, of the regularity properties that characterize distance-regular graphs. In this paper we propose two new dual concepts of almost distance-regularity, thus giving a better understanding of the properties of distance-regular graphs. More precisely, we characterize m-partially distance-regular graphs and j-pu...
متن کامل